#include <iostream>
#include <cmath>
#include <cstring>
#include <algorithm>

using namespace std;

int n,a[1000],j;

void f(int k,int i)
{
	if(k==n)
	{
		a[i]=k;
		cout << a[0];
		for(j=1;j<=i;j++)cout << "-" << a[j];
		cout << endl;
	}
	else
	{
		a[i]=k;
		if(k+1<=n)f(k+1,i+1);
		if(k+2<=n)f(k+2,i+1);
	}
}

int main()
{
	cin >> n;
	f(0,0);
	return 0;
}
